Counter-Model Search in Gödel-Dummett Logics
نویسنده
چکیده
We present a new method for deciding Gödel-Dummett logic LC. We first characterize the validity of irreducible sequents of LC by the existence of r-cycles in bi-colored graphs and we propose a linear algorithm to detect r-cycles and build counter-models. Then we characterize the validity of formulae by the existence of r-cycles in boolean constrained graphs. We also give a parallel method to detect r-cycles under boolean constraints. Similar results are given for the finitary versions LCn.
منابع مشابه
Bounding Resource Consumption with Gödel-Dummett Logics
Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted • is explicit and provide an operational semantics which meas...
متن کاملCombining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic
We present an algorithm for deciding Gödel-Dummett logic. The originality of this algorithm comes from the combination of proofsearch in sequent calculus, which reduces a sequent to a set of pseudoatomic sequents, and counter-model construction of such pseudo-atomic sequents by a fixpoint computation. From an analysis of this construction, we deduce a new logical rule [⊃N ] which provides short...
متن کاملOn interplay of quantifiers in Gödel-Dummett fuzzy logics
Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of ...
متن کاملTranslating Labels to Hypersequents for Intermediate Logics with Geometric Kripke Semantics
We give a procedure for translating geometric Kripke frame axioms into structural hypersequent rules for the corresponding intermediate logics in Int/Geo that admit weakening, contraction and in some cases, cut. We give a procedure for translating labelled sequents in the corresponding logic to hypersequents that share the same linear models (which correspond to Gödel-Dummett logic). We prove t...
متن کاملGödel-Dummett Counter-models through Matrix Computation
We present a new method for deciding Gödel-Dummett logic. Starting from a formula, it proceeds in three steps. First build a conditional graph based on the decomposition tree of the formula. Then try to remove some cycles in this graph by instantiating these boolean conditions. In case this is possible, extract a countermodel from such an instance graph. Otherwise the initial formula is provabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004